Computational problem - PDFSEARCH.IO - Document Search Engine

Computational problem
Results: 1172

#	Item
521	WO RKSHO P O N PARAM ETERI ZED CO M PLEXI TY http:/ / fpt.wikidot.com 30&31 March 2010 The University of Newcastle, AU ABSTRACTS OF TALKS Add to Reading List Source URL: fpt.wdfiles.com Language: English - Date: 2012-09-17 04:49:01 Complexity classes NP-complete problems Analysis of algorithms Parameterized complexity NP-complete Vertex cover Time complexity Travelling salesman problem Matching Theoretical computer science Computational complexity theory Applied mathematics
522	 FHI TECHNICAL REPORT  MDL Intelligence Distillation: Exploring strategies for safe access to superintelligent problem-solving capabilities K. Eric Drexler Add to Reading List Source URL: www.fhi.ox.ac.uk Language: English - Date: 2015-04-27 05:33:23 Science Singularitarianism Sociocultural evolution Superintelligence Computational neuroscience Risks to civilization humans and planet Earth Artificial intelligence Distillation Friendly artificial intelligence Futurology Time Future
523	THE COMPLEXITY OF ANALOG COMPUTATION † Anastasios VERGIS Department of Computer Science, University of Minnesota, Minneapolis, MN 55455, U.S.A. Kenneth STEIGLITZ Department of Computer Science, Princeton University, Pr Add to Reading List Source URL: www.cs.princeton.edu Language: English - Date: 2001-11-25 03:18:59 Complexity classes Mathematical optimization Structural complexity theory Computability theory P versus NP problem NP-complete NP PP Analog computer Theoretical computer science Computational complexity theory Applied mathematics
524	100707_PJIM_ID062_Mendel_v-2.indd Add to Reading List Source URL: piim.newschool.edu Language: English - Date: 2015-01-22 17:47:52 Computer graphics Scientific modeling Educational psychology Visualization Knowledge Ethology Problem solving Design Information mapping Infographics Science Computational science
525	Combining Constraint Propagation and Discrete Ellipsoid-Based Search to Solve the Exact Quadratic Knapsack Problem Wen-Yang Ku and J. Christopher Beck Department of Mechanical & Industrial Engineering University of Toron Add to Reading List Source URL: tidel.mie.utoronto.ca Language: English - Date: 2015-01-28 09:11:33 Computational complexity theory Mathematical optimization Constraint programming Quadratic programming Linear programming Semidefinite programming Local consistency Knapsack problem Constraint satisfaction Operations research Theoretical computer science Applied mathematics
526	A Polynomial Time Approximation Scheme for k-Consensus Clustering∗ Tom Coleman† Abstract This paper introduces a polynomial time approximation scheme for the metric Correlation Clustering problem, when the number of Add to Reading List Source URL: tom.thesnail.org Language: English - Date: 2015-05-04 03:09:24 Approximation algorithms Cluster analysis Combinatorial optimization NP-complete problems Complexity classes Correlation clustering Consensus clustering Optimization problem Minimum k-cut Theoretical computer science Computational complexity theory Statistics
527	A Linear Kernel for the Complementary Maximal Strip Recovery Problem Binhai Zhu Computer Science Department Add to Reading List Source URL: www.cs.ucr.edu Language: English - Date: 2012-12-29 15:19:34 Analysis of algorithms Parameterized complexity NP-complete problems Kernelization Time complexity Vertex cover Algorithm Approximation algorithm Theoretical computer science Computational complexity theory Applied mathematics
528	Simple Rules for Low-Knowledge Algorithm Selection? J. Christopher Beck and Eugene C. Freuder Cork Constraint Computation Centre, Department of Computer Science, University College Cork, Cork, Ireland {c.beck,e.freuder}@ Add to Reading List Source URL: tidel.mie.utoronto.ca Language: English - Date: 2006-01-18 12:07:28 Theoretical computer science Operations research Algorithm Mathematical logic Genetic algorithm Computational complexity theory Online algorithm Travelling salesman problem Ant colony optimization algorithms Mathematics Applied mathematics Mathematical optimization
529	COMS21103 NP-completeness (or how to prove that problems are probably hard) Ashley Montanaro Add to Reading List Source URL: www.cs.bris.ac.uk Language: English - Date: 2014-01-08 09:09:08 Complexity classes Analysis of algorithms Mathematical optimization Time complexity Algorithm P NP-complete P versus NP problem Quantum algorithm Theoretical computer science Computational complexity theory Applied mathematics
530	Donati et al. Algorithms for Molecular Biology:3 DOIs13015SOFTWARE ARTICLE Open Access Add to Reading List Source URL: www.almob.org Language: English Operations research Mathematics Search algorithms Computational complexity theory Dynamic programming Optimal control Optimization problem Reduction Genetic algorithm Theoretical computer science Applied mathematics Mathematical optimization

UPDATE